Competitive Paging Algorithms
نویسندگان
چکیده
*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer Science, Computer Science Division, University of California, Berkeley, CA 94720; ‘Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M6C 3B7; ‘Department of Mathematics and Computer Science, Amherst College, Amherst, Massachusetts 01002; “School of Computer Science, Carnegie Mellon Unicjersity, Pittsburgh, Pennsylvania 15213; and ‘Computer Science Department, Princeton University, Princeton, New Jersey 08544.
منابع مشابه
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, ...
متن کاملMinimizing Cache Usage in Paging
Traditional paging models seek algorithms that maximize their performance while using the maximum amount of cache resources available. However, in many applications this resource is shared or its usage involves a cost. In this work we introduce the Minimum Cache Usage problem, which is an extension to the classic paging problem that accounts for the efficient use of cache resources by paging al...
متن کاملOn the optimality of Least Recently Used
It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing leastrecently-used (LRU). In this paper, we study this fundamental online problem from the viewpoint of stochastic...
متن کاملTruly Online Paging with Locality of Reference
The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access gr...
متن کاملAlternatives to competitive analysis
Competitive analysis allows us to make strong theoretical statements about the performance of an algorithm without making probabilistic assumptions on the inputs. However, it has been often criticized with respect to its realism. A wide range of online algorithms –both good and not so good in practice– seem to have the same competitive ratio. A concrete example of this is the inability of compe...
متن کاملRandomized Paging Algorithms and Measures for their Performance
We study three raLdomized paging algorithms, using two different measures for their per formances. One of the measures is the competitive ratio which was introduced by Sleator and Tarjan [ST8S]. Although it is well-motivated, Ben-David and Borodin [BDB] have recently demonstrated some counter-intuitive features of this measure (concerning the roles of memory and finite look&head i'l online alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 12 شماره
صفحات -
تاریخ انتشار 1991